On the Undecidability of the Situation Calculus Extended with Description Logic Ontologies
نویسندگان
چکیده
In this paper we investigate situation calculus action theories extended with ontologies, expressed as description logics TBoxes that act as state constraints. We show that this combination, while natural and desirable, is particularly problematic: it leads to undecidability of the simplest form of reasoning, namely satisfiability, even for the simplest kinds of description logics and the simplest kind of situation calculus action theories.
منابع مشابه
Logic Agents and Conceptual Interoperability through Semantic Web Technologies
This article describes one possible option on how the flexible and open world of Semantic Web Technologies such as the Resource Description Framework, the Web Ontology Language (OWL) or other languages compatible to the Jena-Model can be integrated with logic based agents implementing the so called Situation Calculus. By integrating both systems tightly all systems’ features are technically mad...
متن کاملComputing Horn Rewritings of Description Logics Ontologies
We study the problem of rewriting an ontology O1 expressed in a DL L1 into an ontology O2 in a Horn DL L2 such that O1 and O2 are equisatisfiable when extended with an arbitrary dataset. Ontologies that admit such rewritings are amenable to reasoning techniques ensuring tractability in data complexity. After showing undecidability whenever L1 extends ALCF , we focus on devising efficiently chec...
متن کاملPolynomial Horn Rewritings for Description Logics Ontologies
We study the problem of rewriting an ontology O1 in a DL L1 into an ontology O2 in a Horn DL L2 such that O1 and O2 are equisatisfiable when extended with any dataset. After showing undecidability whenever L1 extends ALCF , we focus on devising efficiently checkable conditions that ensure existence of a Horn rewriting. By lifting existing Datalog rewriting techniques for Disjunctive Datalog pro...
متن کاملDescription Logic Actions with general TBoxes: a Pragmatic Approach
Action formalisms based on description logics (DLs) have recently been introduced as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent Calculus. However, existing DL action formalisms fail to include general TBoxes, which are the standard tool for formalising ontologies in modern description logics. We define a DL action formalism that admits ...
متن کاملJust: a Tool for Computing Justifications w.r.t. ELH Ontologies
We introduce the tool Just for computing justifications for general concept inclusions w.r.t. ontologies formulated in the description logic EL extended with role inclusions. The computation of justifications in Just is based on saturating the input axioms under all possible inferences w.r.t. a consequence-based calculus. We give an overview of the implemented techniques and we conclude with an...
متن کامل